Speeding Up Elliptic Scalar Multiplication with Precomputation
نویسندگان
چکیده
It is often required in many elliptic curve cryptosystems to compute kG for a xed point G and a random integer k. In this paper we present improved algorithms for such elliptic scalar multiplication. Implementation results on Pentium II and Alpha 21164 microprocessors are also provided to demonstrate the presented improvements in actual implementations.
منابع مشابه
Speeding up Elliptic Curve Scalar Multiplication without Precomputation
This paper presents a series of Montgomery scalar multiplication algorithms on general short Weierstrass curves over odd characteristic fields, which need only 12 field multiplications plus 12 ∼ 20 field additions per scalar bit using 8 ∼ 10 field registers, thus significantly outperform the binary NAF method on average. Over binary fields, the Montgomery scalar multiplication algorithm which w...
متن کاملFast Scalar Multiplication for Elliptic Curves over Binary Fields by Efficiently Computable Formulas
This paper considers efficient scalar multiplication of elliptic curves over binary fields with a twofold purpose. Firstly, we derive the most efficient 3P formula in λ-projective coordinates and 5P formula in both affine and λ-projective coordinates. Secondly, extensive experiments have been conducted to test various multi-base scalar multiplication methods (e.g., greedy, ternary/binary, multi...
متن کاملPerformance Analysis of the Postcomputation- Based Generic-Point Parallel Scalar Multiplication Method
A Postcomputation-based generic-point parallel scalar multiplication method has recently been proposed for high-performance end servers that employ parallel elliptic curve cryptoprocessors. The sequential precomputation overheads, in the postcomputation-based method, are replaced with parallelizable postcomputations. This paper analyzes the performance of the postcomputation-based method with 1...
متن کاملCOMPARISON OF ALGORITHMS FOR ELLIPTIC CURVE CRYPTOGRAPHY OVER FINITE FIELDS OF GF(2m)
For elliptic curve cryptosystems does exist many algorithms, that computes the scalar multiplication k·P. Some are better for a software solution and others are better for a hardware solution. In this paper we compare algorithms without precomputation for the scalar multiplication on elliptic curves over a finite field of GF(2). At the end we show which algorithm is the best for a hardware or s...
متن کاملGPU Accelerated Elliptic Curve Cryptography in
This paper presents the Graphics Processing Unit (GPU) accelerated version of the LSB Invariant scalar point multiplication for binary elliptic curves. This method was implemented using the CUDA programming language for nVidia graphics cards. With a parallel factor of (length+1) and LópezDahab projective coordinate Pi’s, on an nVidia GTX 285 graphics card precomputation takes 190.203995 ms whil...
متن کامل